Distributing Matrix Eigenvalue Calculations over Transputer Arrays
نویسندگان
چکیده
We discuss the parallel numerical solution of the matrix eigenvalue problem for real symmetric tridiagonal matrices. Instances occur frequently in practice. Two implementations of the Sturm sequence algorithm on transputer arrays are described. For the first the maximum size of matrices which may be accommodated is restricted by the amount of local memory available. The second implementation removes this constraint but requires an increased execution time.
منابع مشابه
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that combines the bisection technique with a fast root-finding procedure to obtain each eigenvalue. We design a parallel algorithm that applies a static distribution of the calculations among processors and three algorithm...
متن کاملThe Bitonic Sort on Transputer Architectures
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for a machine and compares this with an implementation on T8 networks to see the benefits that the new architecture provides over the previous generation of Transputers.
متن کاملApplication of Decoupled Scaled Boundary Finite Element Method to Solve Eigenvalue Helmholtz Problems (Research Note)
A novel element with arbitrary domain shape by using decoupled scaled boundary finite element (DSBFEM) is proposed for eigenvalue analysis of 2D vibrating rods with different boundary conditions. Within the proposed element scheme, the mode shapes of vibrating rods with variable boundary conditions are modelled and results are plotted. All possible conditions for the rods ends are incorporated ...
متن کاملA hexagonally connected processor array for Jacobi-type matrix algorithms∗
Indexing terms : Parallel algorithms, systolic arrays, matrix computation Jacobi-type matrix algorithms are mostly implemented on orthogonally connected processor arrays. In this letter, an alternative partitioning is described, resulting in a grid of hexagonally connected processors. This partitioning is shown to be over four times more efficient, as compared to the original configuration. Int...
متن کاملAn Improved 2-D DOA Estimation with L-shaped Arrays Based on PM
In this paper, an improved two-dimensional (2-D) direction of arrival (DOA) estimation method is proposed for narrow signals impinging on an L-shaped arrays. Based on the propagator method (PM), the computational loads of the proposed method can be significantly smaller since the PM does not require any eigenvalue decomposition of the received data. With a propagator matrix, the proposed method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007